Location:
Search - source knapsack
Search list
Description: 一个解决0-1背包问题的源程序，是用递归做的-A solution of 0-1 knapsack problem source is the use of recursive make the
Platform: |
Size: 1024 |
Author: 吴剑清 |
Hits:
Description: 数据结构典型问题，背包问题的求解源码，c-Typical data structure problem, Knapsack Problem Solving source, c
Platform: |
Size: 611328 |
Author: 钉子 |
Hits:
Description: 用回溯法求解0-1背包问题 用vc++实现 包含完整源代码 经过测试成功！-Retrospective method with 0-1 knapsack problem with vc++ Achieve that contains a complete source code has been tested successfully!
Platform: |
Size: 386048 |
Author: you shiming |
Hits:
Description: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source
Platform: |
Size: 15360 |
Author: 海霞 |
Hits:
Description: 经典问题----背包问题的java源代码，求解-Knapsack problem---- the classic problem of the java source code, to solve
Platform: |
Size: 10240 |
Author: zhaopengfei |
Hits:
Description: 动态规划策略实现0-1背包问题的JAVA源程序-Dynamic planning strategy for the achievement of 0-1 Knapsack Problem JAVA source code
Platform: |
Size: 3072 |
Author: yibin |
Hits:
Description: 背包问题分枝界限算法的源代码 其中包括背包容量、下限、剩余容量、当前价值之和
等-Branch-and-bound algorithm for knapsack problem of the source code including backpack capacity, the lower limit, the remaining capacity, the current value and so on
Platform: |
Size: 2048 |
Author: 李辉 |
Hits:
Description: 0－1的小偷背包问题源码，给出可偷东西的个数和可以拿走的最大重量，算法可以给出在这个条件下的最优解。-0-1 knapsack problem thieves source, give the number of things can be stolen and taken away the largest weight in the algorithm can give optimal solution under the conditions.
Platform: |
Size: 1024 |
Author: luxin |
Hits:
Description: 9. 背包问题源码。设有一个背包可以放入物品的重量为s，现有n件物品，重量分别为w[0],w[1],...,[n-1]。问题是能否从这n件物品中选择若干件放入此背包中使得放入的重量之和正好等于s。如果存在一种符合上述要求的选择，则称此背包问题有解；否则称此背包问题无解。
数据输入：
第一行：测试集合个数m。
第二行：第一个测试用例的s值。
第三行：第一个测试用例的物品数量n。
第四行：第一个测试用例的n件物品的重量，中间用空格分开。
第五行：第二个测试用例的s值。
第六行：第二个测试用例的物品数量n。
第七行：第二个测试用例的n件物品的重量，中间用空格分开。
………
第2m行：第m个测试用例的s值。
第2m＋1行：第m个测试用例的物品数量n。
第2m＋2行：第m个测试用例n件物品的重量，中间用空格分开。
数据输出t：
第一行到第m行：分别输出是否成功，如果可以放入和为s的物品，则输出1，否则输出0。
示例：
输入文件input13.txt：
2
21
5
2 5 9 11 13
13
4
2 3 5 8
输出：（标准输出）
0
1
-Knapsack problem source. There is a backpack the weight can be placed for the s, the existing n items separately for the weight w [0], w [1 ],...,[ n-1]. Can this problem are n items in a number of select Add Add this backpack allows the weight of the equal and just s. If there is a selection of these requirements, then to solve this knapsack problem otherwise, that no solution of this knapsack problem.
Data entry:
First line: test set the number of m.
The second line: The first test case of the s value.
Third line: the first test case the number of items n.
Fourth line: the first test case of the n items of weight, separated by a space between.
Fifth row: The second test case of the s value.
Sixth line: The second test case the number of items n.
Seventh line: The second test case of the n items of weight, separated by a space between.
... ... ...
The first 2m line: the first m of the s values of test cases.
2m+1 the first line:
Platform: |
Size: 1024 |
Author: 罗特 |
Hits:
Description: 这是学习动态规划时用动态规划设计分析实际问题，用动态规划方法设计的数塔问题，棋盘覆盖，和01背包问题的源码，希望朋友们需要的话可以下载-This is used to study dynamic programming dynamic programming design and analysis of practical problems, using dynamic programming method of a number of tower design problem, board cover, and the source 01 knapsack problem, I hope my friends can download if necessary to see
Platform: |
Size: 2048 |
Author: 张陆军 |
Hits:
Description: 01 背包问题的 c语言源代码实现
很简单-01 knapsack problem c language source code of the implementation
Platform: |
Size: 1024 |
Author: linjia |
Hits:
Description: 用C#编写的利用遗传算法解决0-1背包问题的源程序，希望对需要的朋友有所帮助-C# prepared with the use of genetic algorithm to solve the 0-1 knapsack problem source, and they hope to help a friend in need
Platform: |
Size: 25600 |
Author: mimi |
Hits:
Description: 一般背包问题的贪心算法 Dijkstra算法求解单源最短路径问题 N皇后问题 Prim算法 Kruskal算法代码-The general knapsack problem greedy algorithm Dijkstra' s algorithm for single-source shortest path algorithm N Queen' s problem Kruskal Algorithm Prim code
Platform: |
Size: 7168 |
Author: liujuan |
Hits:
Description: 背包问题（贪婪算法）c语言源代码。希望有帮助！-Knapsack problem (greedy algorithms) c language source code. Hope that helps!
Platform: |
Size: 1024 |
Author: wang_yufang |
Hits:
Description: source code for Knapsack 0-1
Platform: |
Size: 2048 |
Author: me |
Hits:
Description: 本代码解决的是背包问题之贪婪算法。采用的是C语言源代码-This code is to solve the knapsack problem of the greedy algorithm. Using the C language source code
Platform: |
Size: 1024 |
Author: yaya |
Hits:
Description: 背包问题及其相应的解决方法
C++源码
背包问题及其相应的解决方法
C++源码-Knapsack problem and its corresponding solution to C++ source code knapsack problem and its corresponding solution to C++ source code
Platform: |
Size: 68608 |
Author: agi995 |
Hits:
Description: 完全背包问题
原创代码
算法 数据结构-Algorithm for knapsack problem completely original source data structure
Platform: |
Size: 1024 |
Author: robey |
Hits:
Description: 01背包问题算法源码，方便大家学习不同算法-01 knapsack problem algorithm source code, to facilitate them to learn from different algorithms
Platform: |
Size: 1024 |
Author: 邓涛 |
Hits:
Description: 实例18
实现基本的串操作
实例19
计算各点到源点的最短距离
实例20
储油问题
实例21
中奖彩球问题
实例22
0-1背包问题-
Instance 18
Achieve the basic string operations
Instance 19
Points to calculate the shortest distance from source
Instance 20
Storage problem
Instance 21
Winning ball problem
Example 22
0-1 knapsack problem
Platform: |
Size: 4096 |
Author: SB |
Hits: